Parallelizing Julia with a Non-Invasive DSL (Artifact)
نویسندگان
چکیده
This artifact is based on ParallelAccelerator, an embedded domain-specific language (DSL) and compiler for speeding up compute-intensive Julia programs. In particular, Julia code that makes heavy use of aggregate array operations is a good candidate for speeding up with ParallelAccelerator. ParallelAccelerator is a non-invasive DSL that makes as few changes to the host programming model as possible. 1998 ACM Subject Classification D.1.3 Parallel Programming
منابع مشابه
Parallelizing Julia with a Non-Invasive DSL
Computational scientists often prototype software using productivity languages that offer highlevel programming abstractions. When higher performance is needed, they are obliged to rewrite their code in a lower-level efficiency language. Different solutions have been proposed to address this trade-off between productivity and efficiency. One promising approach is to create embedded domain-speci...
متن کاملSignal quality of simultaneously recorded invasive and non-invasive EEG
Both invasive and non-invasive electroencephalographic (EEG) recordings from the human brain have an increasingly important role in neuroscience research and are candidate modalities for medical brain-machine interfacing. It is often assumed that the major artifacts that compromise non-invasive EEG, such as caused by blinks and eye movement, are absent in invasive EEG recordings. Quantitative i...
متن کاملTechnical Report about Tiramisu: a Three-Layered Abstraction for Hiding Hardware Complexity from DSL Compilers
High-performance DSL developers work hard to take advantage of modern hardware. The DSL compilers have to build their own complex middle-ends before they can target a common back-end such as LLVM, which only handles single instruction streams with SIMD instructions. We introduce Tiramisu, a common middle-end that can generate efficient code for modern processors and accelerators such as multico...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملParallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are restricted to centralized query processors, limiting scalability and imposing a single point of failure. In this paper, we address the problem of parallelizing skyline query execution over a large number of machines by le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- DARTS
دوره 3 شماره
صفحات -
تاریخ انتشار 2017